Two meta-heuristics for solving the multi-vehicle multi-covering tour problem with a constraint on the number of vertices
نویسندگان
چکیده
منابع مشابه
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<X=, E), where= is a set of vertices that must collectively be covered by up to m vehicles. The problem consists of determining a set of total minimum length vehicle routes on a subset of <, subject to side constraints, such that every vertex of= is within a prespeci"ed distance from a route. Three heuristics are developed for this...
متن کاملAn exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
The multi-vehicle covering tour problem (m-CTP) involves finding a minimumlength set of vehicle routes passing through a subset of vertices, subject to constraints on the length of each route and the number of vertices that it contains, such that each vertex not included in any route lies within a given distance of a route. This paper tackles a particular case of m-CTP where only the restrictio...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2020
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor200115014k